A Consistent Labeling Algorithm for the Frequency/Code Assignments in a Rapidly Deployable Radio Network

The Rapidly Deployable Radio Network (RDRN) is an Advanced Research Projects Agency (ARPA) grant awarded to the University of Kansas's Telecommunications and Information Sciences Laboratory (TISL). The goal of this project is to develop a portable high speed wireless communications network that could easily be deployed in a time of battle or emergency. One of the major obstacles facing a decentralized wireless network is its topological con guration. This network consists of a collection of asynchronous transfer mode (ATM) switch nodes that are capable of forming multiple radio links with one another. Since these beams can be unintentionally received by another node, interference may occur. To provide e ective communication throughout the network, an algorithm must carefully establish links between nodes. The con guration algorithm must also ensure that the network is fully connected. By modeling RDRN as a consistent labeling (U;L; T;R) model [HAR79] a tree search is used to nd the non-interfering network con gurations. This does not, however, guarantee full network communication. A connectivity matrix is created showing direct node communications. Another tree search is then used to nd communication classes of this matrix. In this manner, network connectivity may be tested. This report documents the ideas and methods that contributed to the above algorithms.